Uniform Generalized Steinhaus Graphs Neal
نویسندگان
چکیده
In [1] it is shown that the rst order theory of almost all generalized Steinhaus graphs is identical to the rst order theory of almost all graphs where each generalized Steinhaus graph is given the same probability. A natural probability measure on generalized Steinhaus graphs is obtained by independently assigning a probability o f p for each entry in the generating string of the graph. With this probability measure it is shown that the rst order theory of almost all uniform generalized Steinhaus graphs is identical to the rst order theory of almost all graphs.
منابع مشابه
Uniform generalized Steinhaus graphs
In [1] it is shown that the first order theory of almost all generalized Steinhaus graphs is identical to the first order theory of almost all where each generalized Steinhaus graph is given the same probability. A natural probability measure on generalized Steinhaus graphs is obtained by independently assigning a probability of p for each entry in the generating string of the graph. With this ...
متن کاملGeneralized steinhaus graphs
A generalized Steinhaus graph of order n and type s is a graph with n vertices whose adjacency matrix (a i;j) satisses the relation a i;j =
متن کاملProperties of Classes of Random Graphs
In 11] it is shown that the theory of almost all graphs is rst order complete. Furthermore , in 3] a collection of rst order axioms are given from which any rst order property or its negation can be deduced. Here we show that almost all Steinhaus graphs satisfy the axioms of almost all graphs and conclude that a rst order property is true for almost all graphs if and only if it is true for almo...
متن کامل2-connected and 2-edge-connected Steinhaus graphs
The numbers of 2-connected and 2-edge-connected Steinhaus graphs with n vertices are determined for n¿ 6. The possible generating strings of 2-connected and 2-edge-connected Steinhaus graphs are classi0ed. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملCharacterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this recursion. Also, we exhibit a lower bound, which is achieved infinitely often, for the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997